Characteristic polynomials of ramified uniform covering digraphs
نویسندگان
چکیده
We give a decomposition formula for the characteristic polynomials of ramified uniform covers of digraphs. Similarly, we obtain a decomposition formula for the characteristic polynomials of ramified regular covers of digraphs. As applications, we establish decomposition formulas for the characteristic polynomials of branched covers of digraphs and the zeta functions of ramified covers of digraphs.
منابع مشابه
Invariant subspace , determinant and characteristic polynomials ∗
Making use of an elementary fact on invariant subspace and determinant of a linear map and the method of algebraic identities, we obtain a factorization formula for a general characteristic polynomial of a matrix. This answers a question posed in [A. Deng, I. Sato, Y. Wu, Characteristic polynomials of ramified uniform covering digraphs, European Journal of Combinatorics 28 (2007), 1099–1114]. T...
متن کاملStructural and spectral properties of minimal strong digraphs
In this article, we focus on structural and spectral properties of minimal strong digraphs (MSDs). We carry out a comparative study of properties of MSDs versus trees. This analysis includes two new properties. The rst one gives bounds on the coe cients of characteristic polynomials of trees (double directed trees), and conjectures the generalization of these bounds to MSDs. As a particular cas...
متن کاملSimplicial ramified covering maps
In this paper we define the concept of a ramified covering map in the category of simplicial sets and we show that it has properties analogous to those of the topological ramified covering maps. We show that the geometric realization of a simplicial ramified covering map is a topological ramified covering map, and we also consider the relation with ramified covering maps in the category of simp...
متن کاملSCHUR COVERS and CARLITZ’S CONJECTURE
We use the classification of finite simple groups and covering theory in positive characteristic to solve Carlitz’s conjecture (1966). An exceptional polynomial f over a finite field Fq is a polynomial that is a permutation polynomial on infinitely many finite extensions of Fq. Carlitz’s conjecture says f must be of odd degree (if q is odd). Indeed, excluding characteristic 2 and 3, arithmetic ...
متن کاملOn the Characteristic and Permanent Polynomials of a Matrix
There is a digraph corresponding to every square matrix over C. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence relation, we found that the characteristic, and permanent polynomials can be calculated in terms of characteristic, and permanent polynomials of some specific induced s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 28 شماره
صفحات -
تاریخ انتشار 2007